Block-cutvertex trees and block-cutvertex partitions
نویسندگان
چکیده
منابع مشابه
Core partitions and block coverings
A number of new results about core partitions have been proved recently. ([2],[3], [9], [12]) For s ∈ N an s-core is by definition an integer partition without hooks of length s. This type of partitions first occurred in modular representation theory of symmetric groups, where s-cores label s-blocks of defect 0 in the case where s is a prime. In the study of relations between blocks for differe...
متن کاملThe centroidal branches of a separable graph are edge reconstructible
If T is a tree, then the weight of a vertex v in T is the number of vertices in a largest component of T − v. The centroid of a tree is the set of vertices of minimum weight. We show that if G is a separable graph then there is a unique block or cutvertex that contains the centroids of all spanning trees of G. We define this block or cutvertex to be the centroid of G. We show that the centroid ...
متن کاملBlock inclusions and cores of partitions
Necessary and sufficient conditions are given for an s-block of integer partitions to be contained in a t-block. The generating function for such partitions is found analytically, and also bijectively, using the notion of an (s, t)-abacus. The largest partition which is both an s-core and a t-core is explicitly given.
متن کاملTwo-Dimensional Block Trees
The Block Tree (BT) is a novel compact data structure designed to compress sequence collections. It obtains compression ratios close to Lempel-Ziv and supports efficient direct access to any substring. The BT divides the text recursively into fixed-size blocks and those appearing earlier are represented with pointers. On repetitive collections, a few blocks can represent all the others, and thu...
متن کاملPartitions with Restricted Block Sizes , Möbius Functions
Given a list of n real numbers, one wants to decide whether every number in the list occurs at least k times. It will be shown that Ω(n log n) is a sharp lower bound for the depth of an algebraic decision or computation tree solving this problem for a fixed k. For linear decision trees, the coefficient can be taken to be arbitrarily close to 1 (using the ternary logarithm). This is done by usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00461-7